Heterogeneous voter models
نویسندگان
چکیده
منابع مشابه
Heterogeneous voter models.
We introduce the heterogeneous voter model (HVM), in which each agent has its own intrinsic rate to change state, reflective of the heterogeneity of real people, and the partisan voter model (PVM), in which each agent has an innate and fixed preference for one of two possible opinion states. For the HVM, the time until consensus is reached is much longer than in the classic voter model. For the...
متن کاملVoter models on heterogeneous networks.
We study simple interacting particle systems on heterogeneous networks, including the voter model and the invasion process. These are both two-state models in which in an update event an individual changes state to agree with a neighbor. For the voter model, an individual "imports" its state from a randomly chosen neighbor. Here the average time TN to reach consensus for a network of N nodes wi...
متن کاملGeneralized voter-like models on heterogeneous networks
1 Departamento de Electromagnetismo y F́ısica de la Materia and Instituto “Carlos I” de F́ısica Teórica y Computacional, Universidad de Granada, Facultad de Ciencias, Fuentenueva s/n, E-18071 Granada, Spain 2 Department of Physics, College of Computer and Information Sciences, Bouvé College of Health Sciences, Northeastern University, Boston MA02120, USA 3 Departament de F́ısica i Enginyeria Nucle...
متن کاملHeterogeneous pair approximation for voter models on networks
For models whose evolution takes place on a network it is often necessary to augment the mean-field approach by considering explicitly the degree dependence of average quantities (heterogeneous mean-field). Here we introduce the degree dependence in the pair approximation (heterogeneous pair approximation) for analyzing voter models on uncorrelated networks. This approach gives an essentially e...
متن کاملVoter model on heterogeneous graphs.
We study the voter model on heterogeneous graphs. We exploit the nonconservation of the magnetization to characterize how consensus is reached. For a network of N nodes with an arbitrary but uncorrelated degree distribution, the mean time to reach consensus T(N) scales as Nmu(2)1/mu(2), where mu(k) is the kth moment of the degree distribution. For a power-law degree distribution n(k) approximat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2010
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.82.010103